Voting games with abstention: Linking completeness and weightedness

نویسندگان

  • Josep Freixas
  • Bertrand Tchantcho
  • Narcisse Tedjeugang
چکیده

Weighted games for several levels of approval in input and output were introduced in [9]. An extension of the desirability relation for simple games, called the influence relation, was introduced for games with several levels of approval in input in [24] (see also [18]). However, there are weighted games not being complete for the influence relation, something different to what occurs for simple games. In this paper we introduce several extensions of the desirability relation for simple games and from the completeness of them it follows the consistent link with weighted games, which solves the existing gap. Moreover, we prove that the influence relation is consistent with a known subclass of weighted games: strongly weighted games.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Achievable hierarchies in voting games with abstention

It is well known that he in‡uence relation orders the voters the same way as the classical Banzhaf and Shapley-Shubik indices do when they are extended to the voting games with abstention (VGA) in the class of complete games. Moreover, all hierarchies for the in‡uence relation are achievable in the class of complete VGA. The aim of this paper is twofold. Firstly, we show that all hierarchies ar...

متن کامل

A Special Case of Penrose’s Limit Theorem When Abstention Is Allowed

In general, analyses of voting power are performed through the notion of a simple voting game (SVG) in which every voter can choose between two options: ‘yes’ or ‘no’. Felsenthal and Machover [Felsenthal, D.S. and Machover, M. (1997), International Journal of Game Theory 26, 335–351.] introduced the concept of ternary voting games (TVGs) which recognizes abstention alongside. They derive approp...

متن کامل

Some Advances in the Theory of Voting Systems Based on Experimental Algorithms

In voting systems, game theory, switching functions, threshold logic, hypergraphs or coherent structures there is an important problem that consists in determining the weightedness of a voting system by means of trades among voters in sets of coalitions. The fundamental theorem by Taylor and Zwicker [8] establishes the equivalence between weighted voting games and k-trade robust games for each ...

متن کامل

Anonymous yes-no voting with abstention and multiple levels of approval

Symmetric (3, 2) simple games serve as models for anonymous voting systems in which each voter may vote “yes,” abstain, or vote “no,” the outcome is “yes” or “no,” and all voters play interchangeable roles. The extension to symmetric (j,2) simple games, in which each voter chooses from among j ordered levels of approval, also models some natural decision rules, such as pass–fail grading systems...

متن کامل

Probabilistic power indices for games with abstention∗

In this paper we introduce eight power indices that admit a probabilistic interpretation for voting rules with abstention or with three levels of approval in the input, briefly (3,2) games. We analyze the analogies and discrepancies between standard known indices for simple games and the proposed extensions for this more general context. A remarkable difference is that for (3,2) games the propo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Decision Support Systems

دوره 57  شماره 

صفحات  -

تاریخ انتشار 2014